A Hybrid Genetic Algorithm for Multiway Graph Partitioning
نویسندگان
چکیده
A hybrid genetic algorithm for multiway graph partitioning is proposed. The algorithm includes an e cient local optimization heuristic. Starting at an initial solution, the heuristic iteratively improves the solution using cyclic movements of vertices. The suggested heuristic performed well in itself and as a local optimization engine in the hybrid genetic algorithm. Combined with the framework of hybrid genetic algorithms, it showed signi cant performance improvement.
منابع مشابه
Csc5160: Combinatorial Optimization and Approximation Algorithms Topic: Graph Partitioning Problems 18.1 Graph Partitioning Problems 18.1.2 Multiway Cut
This lecture gives a general introduction of graph partitioning problems. We will begin with the definitions of some classic graph partitioning problems (e.g. multiway cut, multicut, sparsest cut), and discuss their relationships. Then we will focus on deriving two approximation algorithms. For the multiway cut problem, we will show a 2-approximation algorithm through a combinatorial argument. ...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملAn Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm
In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...
متن کاملA Hybrid Genetic Search for Multi way Graph Partitioning Based on Direct Partitioning
Multi way partitioning is an important ex tension of two way partitioning as it provides a natural and direct model for many parti tioning applications In this paper we pro pose a hybrid genetic algorithm for k way partitioning The algorithm includes an ef cient local optimization heuristic which is not based on the bisection method It con siderably outperformed existing k way parti tioning alg...
متن کاملMultiway partitioning via geometric embeddings, orderings, and dynamic programming
AbstructThis paper presents effective algorithms for multiway partitioning. Confirming ideas originally due to Hall, we demonstrate that geometric embeddings of the circuit netlist can lead to high-quality k-way partitionings. The netlist embeddings are derived via the computation of d eigenvectors of the Laplacian for a graph representation of the netlist. As Hall did not specify how to partit...
متن کامل